node of graph
英 [nəʊd ɒv ɡræf]
美 [noʊd əv ɡræf]
【计】图节点
双语例句
- To meet the needs of its application in the finite element method calculation, additional definitions of the node of network in graph theory are made.
结合有限元素法计算中应用的需要对图论中网络节点的有关定义作了适当的补充。 - In this paper introduced a method of converting the intersection of node pair to the nesting of them, by using the concept of combined node pairs, then the graph method, which simulated the case of nesting of node pairs, can be applied.
本文利用合成节点对的概念将节点对的交叉情况变换成节点对的嵌套情况，然后就可以应用图形法像处理嵌套的情况那样进行模拟。 - This article intended to introduce the idea of generalized node point, and to give an expressive method of graph.
试图提出广义结点概念，并给出图的一种表示方法。 - In wireless ad hoc group, the process to search the trunk node and the virtual backbone formatted with the head nodes is similar to solving process of minimum connected dominating set and minimum dominating set problem in graph theory.
在无线自组网中搜索主干节点和群首形成虚拟骨干网的过程类似于图论中的最小连通支配集和最小支配集问题的求解过程。 - According to the condition of each node and using the problem of graph division as model, the assignment of threads is based on Genetic Algorithms, thereby new way to solve this problem is provided.
该方法根据网络中各个节点的使用状况，以图分割问题为模型，利用遗传算法对线程进行合理分配，从而为解决该问题提供了新途径。 - Unlike other databases which store their data in rows, columns or key-value pairs a graph database stores all information in a network of nodes and edges.
和其他以列、行或者键/值等形式存储数据的数据库不同，图形数据库以节点（Node）和边（Edge）的网络存储所有信息。 - You can visualize a DirectedGraph as a2-D graph that has a finite number of Nodes, with each Node located at some Point, and the adjacent Nodes joined ( or connected) to each other by Edges.
您可以将DirectedGraph形象化为拥有有限数量的Node的一个2-D图形，在该图形中，每个Node都位于一些Point上，相邻的Node是通过Edges连接在一起的。 - Node Aggregation of Bayesian Network Based on Chain Graph
基于链图的Bayesian网结点聚集 - By graph theory, an in-depth analysis to node adjacent matrix and the judgment criterion of connected graph is performed.
结合图论知识，深入分析了节点邻接矩阵，提出了图的连通性判定准则。 - This method makes every frame of motion data a node of motion graph, and create transitions between similar postures as edges of the graph.
将运动捕获数据中的每一帧的姿势作为运动图的一个节点，再找到这些姿势中相近的姿势，为其创建运动之间的过渡，作为运动图的边。